package edu.whut.recursion;
/*
求5的阶乘
 */
public class RecursionDemo01 {
    public static void main(String[] args) {
        System.out.println(f(5));
    }
    public  static int f(int n){
        if(n==1) return 1;
        else return n*f(n-1);
    }
}
